A PVS Theory for Term Rewriting Systems
نویسندگان
چکیده
منابع مشابه
A PVS Theory for Term Rewriting Systems
A theory, called trs, for Term Rewriting Systems in the theorem Prover PVS is described. This theory is built on the PVS libraries for finite sequences and sets and a previously developed PVS theory named ars for Abstract Reduction Systems which was built on the PVS libraries for sets. Theories for dealing with the structure of terms, for replacements and substitutions jointly with ars allow fo...
متن کاملTransfinite Rewriting Semantics for Term Rewriting Systems
We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...
متن کاملNatural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the most efficient of all being the natural rewriting strategy [9]. All the strategies so far, including natural rewriting, assume that the given term rewriting system is a left-linear constructor system. Although these rest...
متن کاملA PVS Theory of Symbolic Transition Systems
This paper describes some work carried out in the context of a project aimed at developing tools for reasoning about the formal description technique Full LOTOS. One of the tasks within this project was the development of a theory of symbolic transition systems for Full LOTOS, and of a corresponding modal logic. This task was carried out with the help of the PVS theorem prover, which served as ...
متن کاملA Theory for Abstract Reduction Systems in PVS
A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) is described. Adequate specifications of basic definitions and notions such as reduction, confluence, normal form are given and well-known results proved, which includes non trivial ones such as Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemma among others....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.07.049